Prize-collecting Point Sets
نویسندگان
چکیده
Given a set of points P in the plane and profits (or prizes) π : P → R≥0 we want to select a maximum profit set X ⊆ P which maximizes P p∈X π(p) − μ(X) for some particular criterion μ(X). In this paper we consider four such criteria, namely the perimeter and the area of the smallest axis-parallel rectangle containing X, and the perimeter and the area of the convex hull conv(X) of X. Our key result is a data structure, called interval heap, that allows us to compute a set of maximum profit with respect to perimeter resp. area of the smallest enclosing axis-parallel rectangle in O `
منابع مشابه
A 4-Approximation Algorithm for k-Prize Collecting Steiner Tree Problems
This paper studies a 4-approximation algorithm for k-prize collecting Steiner tree problems. This problem generalizes both k-minimum spanning tree problems and prize collecting Steiner tree problems. Our proposed algorithm employs two 2-approximation algorithms for k-minimum spanning tree problems and prize collecting Steiner tree problems. Also our algorithm framework can be applied to a speci...
متن کاملThe prize-collecting generalized minimum spanning tree problem
The prize-collecting generalized minimum spanning tree (PC-GMST) is defined as follows: Given an undirected graph G = (V, E), with node set V, edge set E, cost vector c ∈ R|E| + on the edges E, prize vector p ∈ R|V | + on the nodes V, and a set of K mutually exclusive and exhaustive node sets V1, ..., VK (i.e., V1 ⋂ Vj = ∅, if i 6= j, and Kk=1 Vk = V ), find a minimum cost tree spanning exactly...
متن کاملPrize-collecting Network Design on Planar Graphs
In this paper, we reduce Prize-Collecting Steiner TSP (PCTSP), Prize-Collecting Stroll (PCS), Prize-Collecting Steiner Tree (PCST), Prize-Collecting Steiner Forest (PCSF) and more generally Submodular Prize-Collecting Steiner Forest (SPCSF) on planar graphs (and more generally bounded-genus graphs) to the same problems on graphs of bounded treewidth. More precisely, we show any α-approximation ...
متن کاملPrize-Collecting Steiner Networks via Iterative Rounding
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network design problem. We show as an structural result that in each iteration of our algorithm there is an LP variable in a basic feasible solution which is at least one-third-integral resulting a 3-approximation algorithm for...
متن کاملNear-Optimal Online Algorithms for Prize-Collecting Steiner Problems
In this paper, we give the first online algorithms with a polylogarithmic competitive ratio for the node-weighted prize-collecting Steiner tree and Steiner forest problems. The competitive ratios are optimal up to logarithmic factors. In fact, we give a generic technique for reducing online prize-collecting Steiner problems to the fractional version of their non-prize-collecting counterparts lo...
متن کاملPartial multicovering and the d-consecutive ones property
A d-interval is the union of d disjoint intervals on the real line. In the d-interval stabbing problem (d-is) we are given a set of d-intervals and a set of points, each d-interval I has a stabbing requirement r(I) and each point has a weight, and the goal is to find a minimum weight multiset of points that stabs each d-interval I at least r(I) times. In practice there is a trade-off between fu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006